Collaborative Learning for Extremely Low Bit Asymmetric Hashing

نویسندگان

چکیده

Hashing techniques are in great demand for a wide range of real-world applications such as image retrieval and network compression. Nevertheless, existing approaches could hardly guarantee satisfactory performance with the extremely low-bit (e.g., 4-bit) hash codes due to severe information loss shrink discrete solution space. In this article, we propose novel Collaborative Learning strategy that is tailored generating high-quality codes. The core idea jointly distill bit-specific informative representations group pre-defined code lengths. learning short among can benefit from manifold shared other long codes, where multiple views different provide supplementary guidance regularization, making convergence faster more stable. To achieve that, an asymmetric hashing framework two variants multi-head embedding structures derived, termed Multi-head Asymmetric (MAH), leading efficiency training querying. Extensive experiments on three benchmark datasets have been conducted verify superiority proposed MAH, shown 8-bit generated by MAH 94.3 percent MAP 1 1. Mean Average Precision (MAP) score CIFAR-10 dataset, which significantly surpasses 48-bit state-of-the-arts tasks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dual Asymmetric Deep Hashing Learning

Due to the impressive learning power, deep learning has achieved a remarkable performance in supervised hash function learning. In this paper, we propose a novel asymmetric supervised deep hashing method to preserve the semantic structure among different categories and generate the binary codes simultaneously. Specifically, two asymmetric deep networks are constructed to reveal the similarity b...

متن کامل

b-Bit Minwise Hashing for Large-Scale Learning

Abstract Minwise hashing is a standard technique in the context of search for efficiently computing set similarities. The recent development of b-bit minwise hashing provides a substantial improvement by storing only the lowest b bits of each hashed value. In this paper, we demonstrate that b-bit minwise hashing can be naturally integrated with linear learning algorithms such as linear SVM and ...

متن کامل

Double-Bit Quantization for Hashing

Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to its fast query speed and low storage cost. Because it is NP hard to directly compute the best binary codes for a given data set, mainstream hashing methods typically adopt a two-stage strategy. In the first stage, severa...

متن کامل

Asymmetric Minwise Hashing

Minwise hashing (Minhash) is a widely popular indexing scheme in practice. Minhash is designed for estimating set resemblance and is known to be suboptimal in many applications where the desired measure is set overlap (i.e., inner product between binary vectors) or set containment. Minhash has inherent bias towards smaller sets, which adversely affects its performance in applications where such...

متن کامل

Asymmetric Deep Supervised Hashing

Hashing has been widely used for large-scale approximate nearest neighbor search because of its storage and search efficiency. Recent work has found that deep supervised hashing can significantly outperform non-deep supervised hashing in many applications. However, most existing deep supervised hashing methods adopt a symmetric strategy to learn one deep hash function for both query points and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering

سال: 2021

ISSN: ['1558-2191', '1041-4347', '2326-3865']

DOI: https://doi.org/10.1109/tkde.2020.2977633